
@article{ApostolicoBreslauer,
  title={An optimal {$O(\log\log n)$}-time parallel algorithm for detecting all squares in a string},
  author={Apostolico, A. and Breslauer, D.},
  journal={SIAM Journal on Computing},
  volume={25},
  number={6},
  pages={1318--1331},
  year={1996},
  publisher={SIAM}
}

@inproceedings{BreslauerGrossiMignosi,
  title={Simple real-time constant-space string matching},
  author={Breslauer, D. and Grossi, R. and Mignosi, F.},
  booktitle={Combinatorial Pattern Matching},
  pages={173--183},
  year={2011},
  organization={Springer}
}

@article{BreslauerItaliano,
  title={Near real-time suffix tree construction via the fringe marked ancestor problem},
  author={Breslauer, D. and Italiano, G. F.},
  journal={Journal of Discrete Algorithms},
  volume={18},
  pages={32--48},
  year={2013},
  publisher={Elsevier}
}

@article{Crochemore,
  title={Transducers and repetitions},
  author={Crochemore, M.},
  journal={Theoretical Computer Science},
  volume={45},
  pages={63--86},
  year={1986},
  publisher={Elsevier}
}

@article{GalilSeiferas,
  title={Time-space-optimal string matching},
  author={Galil, Z. and Seiferas, J.},
  journal={Journal of Computer and System Sciences},
  volume={26},
  number={3},
  pages={280--294},
  year={1983},
  publisher={Elsevier}
}


@article{HongChen,
  title={Efficient on-line repetition detection},
  author={Hong, J.-J. and Chen, G.-H.},
  journal={Theoretical Computer Science},
  volume={407},
  number={1},
  pages={554--563},
  year={2008},
  publisher={Elsevier}
}

@incollection{JanssonPeng,
  title={Online and dynamic recognition of squarefree strings},
  author={Jansson, J. and Peng, Z.},
  booktitle={Mathematical Foundations of Computer Science 2005},
  pages={520--531},
  year={2005},
  publisher={Springer}
}

@inproceedings{KolpakovKucherov,
  title={Finding maximal repetitions in a word in linear time},
  author={Kolpakov, R. and Kucherov, G.},
  booktitle={Foundations of Computer Science, 1999. 40th Annual Symposium on},
  pages={596--604},
  year={1999},
  organization={IEEE}
}

@inproceedings{Kosolobov,
  author ={Kosolobov, D.},
  title = {{Lempel-Ziv factorization may be harder than computing all runs}},
  booktitle ={32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)},
  volume ={30},
  series ={Leibniz International Proceedings in Informatics (LIPIcs)},
  pages ={582--593},
  year ={2015},
  publisher ={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
}

@inproceedings{Kosolobov,
  title={Lempel-Ziv factorization may be harder than computing all runs},
  author={Kosolobov, D.},
  booktitle={STACS},
  volume={20},
  pages={20--31},
  year={2015}
}

@incollection{LeungPengTing,
  title={An efficient online algorithm for square detection},
  author={Leung, H.-F. and Peng, Z. and Ting, H.-F.},
  booktitle={Computing and Combinatorics},
  pages={432--439},
  year={2004},
  publisher={Springer}
}

@incollection{MainLorentz,
  title={Linear time recognition of squarefree strings},
  author={Main, M. G. and Lorentz, R. J.},
  booktitle={Combinatorial Algorithms on Words},
  pages={271--278},
  year={1985},
  publisher={Springer}
}

@article{Shur,
  title={Generating square-free words efficiently},
  author={Shur, A. M.},
  journal={accepted to WORDS'2013 special issue of Theoretical Computer Science},
  year={2014}
}

@incollection{Thue,
  title={{\"U}ber unendliche Zeichenreihen (1906)},
  author={Thue, A.},
  booktitle={Selected mathematical papers of Axel Thue},
  year={1977},
  publisher={Universitetsforlaget}
}

@inproceedings{Weiner,
  title={Linear pattern matching algorithms},
  author={Weiner, P.},
  booktitle={Switching and Automata Theory, 1973. SWAT'08. IEEE Conference Record of 14th Annual Symposium on},
  pages={1--11},
  year={1973},
  organization={IEEE}
}
